Protocol Conformance through Refinement Mappings in Cadence SMV
نویسندگان
چکیده
منابع مشابه
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The algorithm guarantees termination in the presence of stopping failures within polynomial expected time. Processes proceed through possibly unboundedly many rounds; at each round, they read the status of all other processe...
متن کاملFormal Verification of Ad hoc On-demand Distance Vector (AODV) Protocol using Cadence SMV
Routing protocols usually consist a huge state space (exponentially increase with the number of entities involved in the protocol) because of the concurrency and data-centric properties. The naïve approaches which directly use traditional verification techniques like explicit state exploration (e.g. Murphy [9]) or symbolic model checking (e.g. SMV [3]) often cannot make much progress due to the...
متن کاملModeling and Verification of Embedded Systems using Cadence SMV
Embedded systems are becoming increasingly popular due to their widespread applications. For safety-critical applications an approach is needed to validate the complexity of VLSI designs at a higher abstraction level. With formal verification we verify that every possible behavior of the target system satisfies the specification. SMV is a formal verification system for hardware designs, based o...
متن کاملAction Refinement in Conformance Testing
In model based testing test cases are derived from a model (the specification) of the system we want to test. In general the model is more abstract than the implementation. This may result in test cases that are not executable, because their actions are too abstract; the implementation does not understand them. The standard approach is to rewrite the model by hand to the required level of detai...
متن کاملModel Checking and Refinement of ASM Models Using SMV
Gurevich’s Abstract State Machines (ASMs) are computational models of systems specified in a high level language (ASM-SL). In this paper, we investigate the pros and cons of the automatic verification of ASM models using the ASM-Workbench and its extention ASM-SMV, which supports computer-aided verification by model checking. The results obtained are based on the validation and verification of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Belgian Mathematical Society - Simon Stevin
سال: 2007
ISSN: 1370-1444
DOI: 10.36045/bbms/1170347813